On Partitioning and Packing Products with Rectangles
نویسندگان
چکیده
منابع مشابه
On Partitioning and Packing Products with Rectangles
In [1] we introduced and studied for product hypergraphs Hn = Qni=1Hi , where Hi = (Vi; Ei) , the minimal size (Hn) of a partition of Vn =Qni=1 Vi into sets that are elements of En = Qni=1 Ei . The main result was that (Hn) = n Y i=1 (Hi); (1) if the Hi's are graphs with all loops included. A key step in the proof concerns the special case of complete graphs. Here we show that (1) also holds wh...
متن کاملPacking anchored rectangles
Let S be a set of n points in the unit square [0, 1], one of which is the origin. We construct n pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in S, and the rectangles jointly cover at least a positive constant area (about 0.09). This is a first step towards the solution of a longstanding conjecture that the rectangles in s...
متن کاملPacking Boundary-Anchored Rectangles
In this paper, we study the boundary-anchored rectangle packing problem in which we are given a set P of points on the boundary of an axis-aligned squareQ. The goal is to find a set of disjoint axis-aligned rectangles in Q such that each rectangle is anchored at some point in P , each point in P is used to anchor at most one rectangle, and the total area of the rectangles is maximized. We show ...
متن کاملAn effective recursive partitioning approach for the packing of identical rectangles in a rectangle
In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heur...
متن کاملEfficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
We provide improved approximation algorithms for several rectangle tiling and packing problems RTILE DRTILE and d RPACK studied in the literature Most of our algorithms are highly e cient since their running times are near linear in the sparse input size rather than in the domain size In addition we improve the best known approximation ratios
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 1994
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548300001334